One Clock Priced Timed Automata: Model Checking and Optimal Strategies
نویسندگان
چکیده
In this paper, we consider priced (or weighted) timed automata, and prove various decidability results when the automaton has only one clock: we prove that model checking of WCTL is decidable and that optimal costs in priced timed games are computable. In contrast, it has recently been proved that these problems are undecidable for this model as soon as the system has three clocks.
منابع مشابه
0 M ay 2 00 8 MODEL CHECKING ONE - CLOCK PRICED TIMED AUTOMATA PATRICIA
We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical temporal logics with cost constraints on modalities. We prove that, under the assumption that the model has only one clock, model-checking this class ...
متن کاملRevisiting Robustness in Priced Timed Games
Priced timed games are optimal-cost reachability games played between two players—the controller and the environment—by moving a token along the edges of infinite graphs of configurations of priced timed automata. The goal of the controller is to reach a given set of target locations as cheaply as possible, while the goal of the environment is the opposite. Priced timed games are known to be un...
متن کاملModel-Checking One-Clock Priced Timed Automata
We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical temporal logics with cost constraints on modalities. We prove that, under the assumption that the model has only one clock, model-checking this class ...
متن کاملSimple Priced Timed Games are not That Simple
Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modeling the costs of spending time in a state and executing an action, respectively). The goals of the players are to minimise and maximise the cost to reach a target location, respectively. We consider priced timed games with one clock and arbitrary (positiv...
متن کاملVerification, Performance Analysis and Controller Synthesis for Real-Time Systems
Particular attention will be given to the theory of the underlying formalisms of the UPPAAL tool suite, including: timed automata, priced timed automata, and (priced) timed games addressing a number of associated decision problems related to model-checking and optimal scheduling and strategies. The lectures will highlight the by now classical region-construction underlying the decidability of s...
متن کامل